def fibo(n):
    """递归函数
    输出斐波那契数列"""
    if n <= 1:
        return n
    else:
        return(fibo(n-1) + fibo(n-2))


def printf(n):
    for i in range(n):
        print(fibo(i))


printf(30)
